A rigorous approach to the decomposition of data structures
نویسندگان
چکیده
Domain decomposition is a well known technique in parallel computing. It requires the decomposition of a problem domain into sub-domains. This involves also a decomposition of the data structures for the problem into substructures, one for each sub-domain. If the data structures are complex, then the decomposition of the data structures may be a complicated task. This paper will show how the problem of decomposition of data structures is signiicantly reduced by rst describing the decomposition of objects on a high level of abstraction and then working down to code level in a rigorous way. It will be shown that the high level decomposition abstracts from the precise form of the data structures, in which the objects are represented. This allows for the construction of one generic mechanism for decomposition of data structures.
منابع مشابه
A simple form of MT impedance tensor analysis to simplify its decomposition to remove the effects of near surface small-scale 3-D conductivity structures
Magnetotelluric (MT) is a natural electromagnetic (EM) technique which is used for geothermal, petroleum, geotechnical, groundwater and mineral exploration. MT is also routinely used for mapping of deep subsurface structures. In this method, the measured regional complex impedance tensor (Z) is substantially distorted by any topographical feature or small-scale near-surface, three-dimensional (...
متن کاملA new Approach Versus Benders Decomposition in Aggregate Production Planning
This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملFace Recognition Based Rank Reduction SVD Approach
Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...
متن کاملTheoretical study of structure spectral properties of Tacrine as Alzheimer drug
Tacrine (9-amino-1,2,3,4-tetrahydroacridine) as a reversible inhibitor of acetylcholinesterase (AChE),was the first drug for the symptomatic treatment of Alzheimer’s disease (AD). NMR structuredetermination still presents some considerable challenges: the method is limited to systems ofrelatively small molecular mass, data collection times are long, data analysis remains a lengthyprocedure, and...
متن کامل